Characterizing Minimum Gossip Graphs on 16 vertices
نویسندگان
چکیده
We introduce a general method for constructing minimum gossip graphs on 2 k vertices, and show that this construction is suucient to get all minimum gossip graphs on 16 vertices. A complete list of all bipartite or all of diameter 4 among them is given.
منابع مشابه
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs
A k-fault-tolerant gossip graph is a (multiple) graph whose edges are linearly ordered such that for any ordered pair of vertices u and v, there are k + 1 edge-disjoint ascending paths from u to v. Let τ(n, k) denote the minimum number of edges in a k-fault-tolerant gossip graph with n vertices. In this paper, we present upper and lower bounds on τ(n, k) which improve the previously known bound...
متن کاملCompounding of gossip graphs
Gossiping refers to the following task: In a group of individuals connected by a communication network, every node has a piece of information and needs to transmit it to all the nodes in the network. The networks are modeled by graphs, where the vertices represent the nodes, and the edges, the communication links. In this paper, we concentrate on minimum gossip graphs of even order, that is, gr...
متن کاملMinimum Linear Gossip Graphs and Maximal Linear ( ; k)-Gossip Graphs
Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using two-way communications between pairs of nodes along the communication links of the network. In this paper, we study gossiping using a linear cost model of communication which includes a start-up time and a propagation...
متن کاملThe spectra of Knödel graphs
Knödel graphs Wd,n are regular graphs on n vertices and degree d. They have been introduced by W. Knödel and have been proved to be minimum gossip graphs and minimum broadcast graphs for d = blog nc. They became even more interesting in the light of recent results regarding the diameter, which is, up to now, the smallest known diameter among all minimum broadcast graphs on 2 vertices. Also, the...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کامل